Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое upper bound - определение
EVERY ELEMENT OF A PARTIALLY ORDERED SET A WHICH IS GREATER (RESP. LOWER) THAN EVERY ELEMENT OF A SUBSET B INCLUDED IN A
Lower bound; Upper bounds; Upper Bound; Upper bound; Upper Bound and Lower Bound; Upper and lower bound; Upper & lower bounds; Tight upper bound; Tight lower bound; Lower and upper bounds; Majorant; Majorized set; Minorant; Minorized; Minorized set; Sharp bound
Найдено результатов: 1528
upper bound
An upper bound of two elements x and y under some relation
<= is an element z such that x <= z and y <= z.
("<=" is written in LaTeX as sqsubseteq).
See also least upper bound.
(1995-02-15)
Upper and lower bounds
In mathematics, particularly in order theory, an upper bound or majorant of a subset of some preordered set is an element of that is greater than or equal to every element of .
least upper bound
LEAST (RESP. GREATEST) OF MAJORING (RESP. MINORING) ELEMENTS OF A PARTIALLY ORDERED SET (NOT NECESSARILY EXISTING IN ALL SETS)
Supremum; Least upper bound; Greatest lower bound; Suprema; Infima; LUB; Lowest upper bound axiom; Smallest upper bound; Infimum; Infima and suprema; Supremum and infimum
<theory> (lub or "join", "supremum") The least upper bound of
two elements a and b is an upper bound c such that a <= c and
b <= c and if there is any other upper bound c' then c <= c'.
The least upper bound of a set S is the smallest b such that
for all s in S, s <= b. The lub of mutually comparable
elements is their maximum but in the presence of incomparable
elements, if the lub exists, it will be some other element
greater than all of them.
Lub is the dual to greatest lower bound.
(In LaTeX, "<=" is written as sqsubseteq, the lub of two
elements a and b is written a sqcup b, and the lub of set S
is written as igsqcup S).
(1995-02-03)
Upper bound theorem
Upper Bound Conjecture
In mathematics, the upper bound theorem states that cyclic polytopes have the largest possible number of faces among all convex polytopes with a given dimension and number of vertices. It is one of the central results of polyhedral combinatorics.
Least-upper-bound property
PROPERTY OF A PARTIALLY ORDERED SET
Least upper bound property; Dedekind complete; Dedekind-complete; Least upper bound axiom; Greatest lower bound property; Least upper bound principle; Dedekind completeness; Supremum property; Dedekind-completeness; Greatest-lower-bound property; Least-upper-bound principle; Lub property
In mathematics, the least-upper-bound property (sometimes called completeness or supremum property or l.u.
supremum
LEAST (RESP. GREATEST) OF MAJORING (RESP. MINORING) ELEMENTS OF A PARTIALLY ORDERED SET (NOT NECESSARILY EXISTING IN ALL SETS)
Supremum; Least upper bound; Greatest lower bound; Suprema; Infima; LUB; Lowest upper bound axiom; Smallest upper bound; Infimum; Infima and suprema; Supremum and infimum
infimum
LEAST (RESP. GREATEST) OF MAJORING (RESP. MINORING) ELEMENTS OF A PARTIALLY ORDERED SET (NOT NECESSARILY EXISTING IN ALL SETS)
Supremum; Least upper bound; Greatest lower bound; Suprema; Infima; LUB; Lowest upper bound axiom; Smallest upper bound; Infimum; Infima and suprema; Supremum and infimum
[?n'f??m?m]
¦ noun Mathematics the largest quantity that is less than or equal to each of a given set or subset of quantities. The opposite of supremum.
Origin
1940s: from L., lit. 'lowest part'.
lub
LEAST (RESP. GREATEST) OF MAJORING (RESP. MINORING) ELEMENTS OF A PARTIALLY ORDERED SET (NOT NECESSARILY EXISTING IN ALL SETS)
Supremum; Least upper bound; Greatest lower bound; Suprema; Infima; LUB; Lowest upper bound axiom; Smallest upper bound; Infimum; Infima and suprema; Supremum and infimum
Piece of unswallowed food that is unknowingly lodged between someone's teeth.
Before I take the photo, you should get rid of that lub.
Before I take the photo, you should get rid of that lub.
greatest lower bound
LEAST (RESP. GREATEST) OF MAJORING (RESP. MINORING) ELEMENTS OF A PARTIALLY ORDERED SET (NOT NECESSARILY EXISTING IN ALL SETS)
Supremum; Least upper bound; Greatest lower bound; Suprema; Infima; LUB; Lowest upper bound axiom; Smallest upper bound; Infimum; Infima and suprema; Supremum and infimum
<theory> (glb, meet, infimum) The greatest lower bound of two
elements, a and b is an element c such that c <= a and c <= b
and if there is any other lower bound c' then c' <= c.
The greatest lower bound of a set S is the greatest element b
such that for all s in S, b <= s. The glb of mutually
comparable elements is their minimum but in the presence of
incomparable elements, if the glb exists, it will be some
other element less than all of them.
glb is the dual to least upper bound.
(In LaTeX "<=" is written as sqsubseteq, the glb of two
elements a and b is written as a sqcap b and the glb of set
S as igsqcap S).
(1995-02-03)
infimum
LEAST (RESP. GREATEST) OF MAJORING (RESP. MINORING) ELEMENTS OF A PARTIALLY ORDERED SET (NOT NECESSARILY EXISTING IN ALL SETS)
Supremum; Least upper bound; Greatest lower bound; Suprema; Infima; LUB; Lowest upper bound axiom; Smallest upper bound; Infimum; Infima and suprema; Supremum and infimum
Википедия
Upper and lower bounds
In mathematics, particularly in order theory, an upper bound or majorant of a subset S of some preordered set (K, ≤) is an element of K that is greater than or equal to every element of S.Dually, a lower bound or minorant of S is defined to be an element of K that is less than or equal to every element of S. A set with an upper (respectively, lower) bound is said to be bounded from above or majorized (respectively bounded from below or minorized) by that bound. The terms bounded above (bounded below) are also used in the mathematical literature for sets that have upper (respectively lower) bounds.
